ANALYTICAL MODEL OF RANDOM MULTIPLE ACCESS PROTOCOL PREDICTIVE P-PERSISTENT CSMA
نویسندگان
چکیده
منابع مشابه
Random Access Career Sense Protocol: A Comparative Analysis of Non Persistent and 1 Persistent CSMA
In this paper we discussed the simulation based comparative analysis of two random access carrier sense protocol ie. Non persistent CSMA and 1 persistent CSMA in wireless network taking considering of random back off algorithm. The feedback comparison of both protocols compared with respect to load on medium utilization and average waiting time. Both results are demonstrated in different load c...
متن کاملPerformance of p-Persistent Frequency-Hopped Slotted Random Access Protocol
We propose a p-persistent protocol for slowfrequency-hopped slotted random access networks, assuming that all the users know the number of backlog users in a slot. The proposed protocol delays new packet transmission until the number of users with a packet to be retransmitted decreases to the threshold or less. Performance of the proposed protocol is evaluated with a two-dimensional Markov chai...
متن کاملOn the Capacity of p-Persistent CSMA
The CSMA-based algorithms constitute a heart of contemporary wireless media access control technology. In last decades, various enhancements have been introduced to basic CSMA schemes, first of all, in order to support collision avoidance. At the same time, the performance analysis of the p-persistent CSMA has gained a renewed interest recently since the behavior of many CSMA protocols might be...
متن کاملPrediction Efficiency in Predictive p-CSMA/CD
Predictive p-persistent CSMA protocol is an important MAC solution developed for networked sensor/control applications and used in Local Operating Networks (LonWorks) technology. The protocol uses a built-in network load prediction to support collision avoidance. The paper presents an analytical study of prediction efficiency for a channel with collision detection. The approach based on Markov ...
متن کاملRude-CSMA: A Multihop Channel Access Protocol
In this paper, we define a two-parameter family of protocols designed for multihop packet radio networks. We call these protocols rude-CSMA because under certain circumstances, maximum throughput is obtained when nodes, even after sensing a busy channel, transmit packets anyway with a nonzero rate. The performance of these protocols is analyzed for various special and random topologies.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Radio Electronics, Computer Science, Control
سال: 2019
ISSN: 2313-688X,1607-3274
DOI: 10.15588/1607-3274-2019-1-18